input queue

См. также в других словарях:

• Input queue — In computer science, an input queue is a collection of processes in storage that are waiting to be brought into memory to run a program …   Wikipedia

• Prefetch input queue — Most modern processors load their instructions some clock cycles before they execute them. This is achieved by pre loading machine code from memory into a prefetch input queue (PIQ).This behavior only applies to von Neumann computers (that is,… …   Wikipedia

• Queue machine — A queue machine or queue automaton is a finite state machine with the ability to store and retrieve data from an infinite memory queue. It is a model of computation equivalent to a Turing machine, and therefore it can process any formal language …   Wikipedia

• queue — ▪ I. queue queue 1 [kjuː] noun [countable] 1. a line of people waiting to enter a building, buy something etc; = line AmE: • There may be long queues outside stores at sale times. ˈdole queue …   Financial and business terms

• Input/output completion port — IOCP redirects here. For the program on IBM mainframes, see Input/Output Configuration Program. Input/Output Completion Port (IOCP) is an API for performing multiple simultaneous asynchronous input/output operations in Windows NT versions 3.5 and …   Wikipedia

• Fluid queue — In probability theory, a fluid queue is a mathematical model used to describe the fluid level in a reservoir subject to randomly determined periods of filling and emptying. The term dam theory was used in earlier literature for these models. The… …   Wikipedia

• Double-ended priority queue — Not to be confused with Double ended queue. A double ended priority queue (DEPQ)[1] is an abstract data type similar to a priority queue except that it allows for efficient removal of both the maximum and minimum element. It is a data structure… …   Wikipedia

• Double-ended queue — Not to be confused with Double ended priority queue. In computer science, a double ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or …   Wikipedia

• UnShuffle sort — is a sort algorithm. IntroductionThe UnShuffle Sort is a distribution or merge sort which was developed by Art S. Kagel. UnShuffle is most efficient when sorting data which exhibits low entropy, in effect where the data is well ordered or… …   Wikipedia

• Three-Level-Scheduling — (TLS) TLS unterteilt den Scheduling Prozess in 3 Teilprozesse: Admission Scheduler Memory Scheduler CPU Scheduler Three Level Scheduling Am Beginn dieses Schedulingverfahrens steht ein Input Queue. Dabei handelt es sich lediglich um eine… …   Deutsch Wikipedia

• POSIX terminal interface — The POSIX terminal interface is the generalized abstraction, comprising both an Application Programming Interface for programs, and a set of behavioural expectations for users of a terminal, as defined by the POSIX standard and the Single Unix… …   Wikipedia